#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
	char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
	while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int l[N],r[N];
vector<PII> v;
int n,m;

void build(int L,int R,int u,int d,int res){
	if(L >= l[u] && R <= r[u]){
		int vl = (L ^ res) & (((1 << 30) - 1) ^ ((1 << d) - 1));
		int vr = vl + (1 << d) - 1;
		 cout << vl << ' ' << vr << endl;
		v.pb({vl,vr});
		return;
	}
	int mid = L + R >> 1;
	if(l[u] <= mid) build(L,mid,u,d - 1,res);
	if(r[u] > mid) build(mid + 1,R,u,d - 1,res);
}

int main() {
	int T;
	read(T);
	while(T--){
		read(n),read(m);
		l[1] = 0,r[1] = m;
		v.clear();
		build(0,(1 << 30) - 1,1,30,n);

		int last = -1;
		int ans = -1;
		sort(all(v));

		for(int i = 0;i < v.size();i++){
			PII t = v[i];
			if(t.fi > last + 1) {
				ans = last + 1;
				break;
			}
			last = max(last,t.se);
		}
		if(ans == -1) ans = v[v.size() - 1].se + 1;
		di(ans);
	}

}

